/**
 * Created with IntelliJ IDEA.
 * Description:
 * User: 86183
 * Date: 2024-01-17
 * Time: 17:55
 */
public class Test {
    public static void main(String[] args) {
        BinaryTree binaryTree=new BinaryTree();
        BinaryTree.TreeNode root=binaryTree.createTree();
        System.out.println(root.val);
        System.out.println("================");
        System.out.println("前序遍历:");
        binaryTree.preOrder(root);
        System.out.println();
        System.out.println("================");
        System.out.println("中序遍历:");
        binaryTree.inOrder(root);
        System.out.println();
        System.out.println("===============");
       System.out.println("后序遍历:");
       binaryTree.postOrder(root);
        System.out.println();
        System.out.println(binaryTree.getHeight(root));

      BinaryTree.TreeNode treeNode=binaryTree.find(root,'M');
        System.out.println(treeNode.val);





    }

}
